Welcome![Sign In][Sign Up]
Location:
Search - min cut

Search list

[Special EffectsMinCutAlgorithm

Description: 这是自己用c#写的一段关于图的最小切的算法,主要参考了论文: 《An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision》 此文中的算法是目前比较优秀的最小切算法
Platform: | Size: 3193 | Author: 张曦 | Hits:

[Special EffectsAn_Experimental_Comparison_of_maxflow_aigorithm.ra

Description: 是基于Graph cuts 的源程序,用来求解Min-Cut/Max-Flow.
Platform: | Size: 50827 | Author: 余丽红 | Hits:

[Special EffectsSegmentation

Description: 医学图象分割软件,使用了基于Min-Cut/Max-Flow开元方程库(可在http://www.adastral.ucl.ac.uk/~vladkolm/software.html下载最新版本) 做分割判断, 并使用cimg库读取dcm图片. 本部分源码只负责切出轮廓, 轮廓将在openGL端中输出.
Platform: | Size: 167247 | Author: zhou | Hits:

[WEB CodeMinCut

Description: Applications of min-cut model.
Platform: | Size: 508817 | Author: dongpei | Hits:

[CSharpmax flow/min cut

Description: max flow/min cut 实现最大流最小割算法的程序
Platform: | Size: 15006 | Author: qinchanchan@163.com | Hits:

[OtherMaximumFlow

Description: 最大最小流程序。包括最大流网络,最小费用最大流。算法的一些实现。-Max-min flow procedures. Including the maximum flow network, minimum cost maximum flow. Some of realize algorithm.
Platform: | Size: 110592 | Author: HuiCong | Hits:

[Special EffectsMinCutAlgorithm

Description: 这是自己用c#写的一段关于图的最小切的算法,主要参考了论文: 《An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision》 此文中的算法是目前比较优秀的最小切算法-This is their use of c# Write a paragraph on the minimum cut graph algorithm, the main reference of the thesis:
Platform: | Size: 3072 | Author: 张曦 | Hits:

[Special EffectsAn_Experimental_Comparison_of_maxflow_aigorithm.ra

Description: 是基于Graph cuts 的源程序,用来求解Min-Cut/Max-Flow.-Graph cuts based on the source code for solving Min-Cut/Max-Flow.
Platform: | Size: 108544 | Author: 余丽红 | Hits:

[Special EffectsSegmentation

Description: 医学图象分割软件,使用了基于Min-Cut/Max-Flow开元方程库(可在http://www.adastral.ucl.ac.uk/~vladkolm/software.html下载最新版本) 做分割判断, 并使用cimg库读取dcm图片. 本部分源码只负责切出轮廓, 轮廓将在openGL端中输出. -Medical image segmentation software, the use of equations based on the Kaiyuan Min-Cut/Max-Flow library (available at http://www.adastral.ucl.ac.uk/ ~ vladkolm/software.html download the latest version) to do partition to judge, and use the library to read CIMG DCM picture. The source code is only responsible for part of the contour cut, contour in openGL output side.
Platform: | Size: 166912 | Author: zhou | Hits:

[AlgorithmMax-IntMax-MinMin-Min

Description: 极小 算法(Min-Min)、极大极小算法(Max-Min)、最大时间跨度算法(Max-Int)三种典型的映射算法的算法原理以及计算程序-Minimal algorithm (Min-Min), max-min algorithm (Max-Min), maximum time-span algorithm (Max-Int) three typical mapping algorithm and the algorithm of the calculation program
Platform: | Size: 108544 | Author: fuhaijun | Hits:

[DocumentsMinCut

Description: Applications of min-cut model.
Platform: | Size: 508928 | Author: dongpei | Hits:

[Windows DevelopFord-Fulkerson

Description: Ford-Fulkerson Min cut / Max flow-Ford-Fulkerson Min cut/Max flow
Platform: | Size: 6144 | Author: M | Hits:

[File FormatGraphCutsinVisionandGraphics

Description: Graph Cuts in Vision and Graphics:Theories and Applications-Combinatorial min-cut algorithms on graphs emerged as an increasingly useful tool for problems in vision.
Platform: | Size: 325632 | Author: 巡洋舰 | Hits:

[Special Effectsnewmaxflowaigorithm

Description: 实现了An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov]中的新的最大流算法,经过实验验证比传统的最大流算法效率更高-Achieved An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov] in the new maximum flow algorithm, after experimental verification than the traditional maximum flow algorithm more efficient
Platform: | Size: 1024 | Author: ray | Hits:

[Graph Recognizeoriginal_GraphCut

Description: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
Platform: | Size: 586752 | Author: pucho | Hits:

[Graph RecognizeMaxFlowcpp

Description: max flow min cut in c++ code
Platform: | Size: 1024 | Author: ansu | Hits:

[Special Effectsgraph-based-image-segmentation

Description: 五种当前主要的基于图的图像分割方法(normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker)的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker.
Platform: | Size: 7720960 | Author: zc | Hits:

[matlabmax-flow-min-cut-theorem

Description: 初学最大流最小割的几个很有用的参考资料,详细介绍了它的应用,很有帮助哦!-Maximum flow minimum cut beginner several useful references, details of its application, very helpful Oh!
Platform: | Size: 4034560 | Author: wade | Hits:

[matlabMaxMin

Description: Max-Min Algorithm for grid scheduling
Platform: | Size: 8192 | Author: hmdrzsharifi | Hits:

[Graph Drawingmax-flow-min-cut

Description: max-flow/min-cut algo
Platform: | Size: 15360 | Author: kunaldanger | Hits:
« 12 3 »

CodeBus www.codebus.net